Prediction of process parameters of water-assisted injection molding based on inverse radial basis function neural network

Because of the introduction of new processing parameters in water-assisted injection molding (WAIM), processes control has become more difficult. First, design of experiment (DOE) was carried out by using optimized Latin hypercubes (Opt LHS). On the basis of this, computational fluid dynamics (CFD) method was used to simulate and calculate hollowed core ratios and wall thickness differences of cooling water pipe at different positions. Then inverse radial basis function (RBF) neural network model reflecting the fitting relationship between processing parameters and molding quality was established, and accuracy of the model was detected by cross validation. Finally, expected molding quality was applied to predict processing parameters, and the obtained molding quality under the predicted processing parameters was verified by computer aided engineering (CAE) simulation and experimental methods. The results showed that mean relative precisions of processing parameters such as melt temperature, delay time, short shot size, water pressure, and mold temperature for inverse RBF model were 98.6%, 93.6%, 98.5%, 93.9%, and 97.9%, respectively, which met the accuracy requirements. Furthermore, compared with expected values of hollowed core ratios and wall thickness differences, the average errors of CAE and experiment were 2.3% and 4.9%, respectively.     

An optimization algorithm for the workforce management in a retail chain

This work proposes a scheduling problem for the workforce management in a chain of supermarkets operating in Italy. We focus on determining the ideal mix of full-time and part-time workers which are needed every week to guarantee a satisfactory service level during the check-out operations. The generation of working shifts, to be assigned to retail workers, is subject to several constraints imposed by both labour laws and enterprise bargaining agreements.We present a mathematical formulation of the problem followed by an exact solution approach which relies on the definition of feasible daily working shifts. The number of feasible daily shifts, that are combined to determine feasible weekly shifts, could drastically increase, depending on the selected planning interval. In addition, there may exist additional constraints, that are difficult to incorporate into the mathematical model. For these reasons, a hybrid heuristic, which does not require the generation of all feasible weekly shifts, is proposed in this paper.Using appropriate statistical techniques, a sensitivity analysis is performed to test the design of the hybrid heuristic. Computational tests are carried out by solving several real instances provided by the retail firm. The results obtained by the heuristic are compared both with an exact approach and with the solutions adopted by the retail company, which have been determined by using a naïf approach. Our hybrid heuristic exhibits excellent performance finding optimal or near optimal solutions in a very limited CPU time.     

Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem

We consider the problem of scheduling a number of jobs on a number of unrelated parallel machines in order to minimize the makespan. We develop three heuristic approaches, i.e., a genetic algorithm, a tabu search algorithm and a hybridization of these heuristics with a truncated branch-and-bound procedure. This hybridization is made in order to accelerate the search process to near-optimal solutions. The branch-and-bound procedure will check whether the solutions obtained by the meta-heuristics can be scheduled within a tight upper bound. We compare the performances of these heuristics on a standard dataset available in the literature. Moreover, the influence of the different heuristic parameters is examined as well. The computational experiments reveal that the hybrid heuristics are able to compete with the best known results from the literature.     

Optimal scheduling of single stage batch plants with direct heat integration

This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method.     

Systematic tool to plan and evaluate demand side strategies during sustained energy crises in hydrothermal power systems

HARE, a systematic tool to evaluate demand side measures to face sustained energy supply risk in hydrothermal power systems is presented in this paper. The main focus of the paper is to help centralized planners to systematically discuss, select, and plan the measures that better respond to the variety of critical situations that can arise due to expected energy shortage, integrate them into the usual medium-term scheduling tool and consequently keep the associated overall costs as low as possible. A medium-term definition of the system state is proposed as a decision-making aid, as well as a set of general energy saving measures that can be applied with their corresponding attributes (time delays, costs of implementation, and energy saving impact). The tool is demonstrated and applied to a simplified version of Chilean’s medium-term hydrothermal scheduling model and to a specific risk scenario experienced during 2011. The results show that it is possible to define various sets of demand side measures that avoid the impacts on the system and subsequently to select among them those with least expected implementation costs. This tool seems mainly useful for hydro-electric systems, which are more vulnerable to sustained energy supply risk. Every power system will have to go through a detailed review and planning process to implement this type of tool.     

Mixed coordination mechanisms for scheduling games on hierarchical machines

In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight.     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.     

Intelligent scheduling of a feature-process-machine tool supernetwork based on digital twin workshop

Modern manufacturing enterprises are shifting toward multi-variety and small-batch production. By optimizing scheduling, both transit and waiting times within the production process can be shortened. This study integrates the advantages of a digital twin and supernetwork to develop an intelligent scheduling method for workshops to rapidly and efficiently generate process plans. By establishing the supernetwork model of a feature-process-machine tool in the digital twin workshop, the centralized and classified management of multiple data types can be realized. A feature similarity matrix is used to cluster similar attribute data in the feature layer subnetwork to realize rapid correspondence of multi-source association information among feature-process-machine tools. Through similarity calculations of decomposed features and the mapping relationships of the supernetwork, production scheduling schemes can be rapidly and efficiently formulated. A virtual workshop is also used to simulate and optimize the scheduling scheme to realize intelligent workshop scheduling. Finally, the efficiency of the proposed intelligent scheduling strategy is verified by using a case study of an aeroengine gear production workshop.     

基于链路可靠性的两跳QoS路由

针对工业无线传感器网络对路由协议的QoS要求，研究了一种基于链路可靠性的两跳QoS路由（Link-Reliability Based Two-Hop Routing for QoS Guarantee in Industrial Wireless Sensor Networks， LRTHQR）.采用两跳速度策略和数据优先级调度策略提高实时性，采用改进的信任评估模型以选择可信路径进行路由，采用基于接收功率的链接概率和数据包重传次数作为衡量链路可靠性的指标，同时采用能够综合考虑节点剩余能量和转发能耗的转发策略，以改善网络寿命.仿真结果显示：与未考虑链路可靠性的NCSRT （NodeCredible Security Routing for IWSN Based on THTR）算法相比， LRTHQR算法在丢包率、时延以及包平均能耗方面有着明显优势；与同样侧重QoS要求的LRTHR （Link-Reliability based Two-Hop Routing）算法相比， LRTHQR算法在截止期错失率、路由开销以及包平均能耗方面有着显著提升.